The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents)
نویسندگان
چکیده
We study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H = (VH ,AH) of D such that (a) S ⊆ VH , (b) H is the union of k directed walks in D, and (c) the underlying graph of H includes a Steiner tree for S in D. We provide several results on the polynomial time tractability, hardness, and parameterized complexity of the problem. keywords: graph searching, FPT-algorithm, NP-hardness, monomial
منابع مشابه
Cooperative Control of Mobile Robots in Creating a Runway Platform for Quadrotor Landing
Multi-agent systems are systems in which several agents accomplish a mission in a cooperative manner. In this paper, a novel idea for the construction of a movable runway platform based on multi-agent systems is presented. It is assumed that an aerial agent (quadrotor) decides to make an emergency landing due to reasons such as a decrease in energy level or technical failure, while there is no ...
متن کاملClearing Connections by Few Agents
We study the problem of clearing connections by agents placed at some vertices in a directed graph. The agents can move only along directed paths. The objective is to minimize the number of agents guaranteeing that any pair of vertices can be connected by a underlying undirected path that can be cleared by the agents. We provide several results on the hardness, approximability and parameterized...
متن کاملDistributed multi-robot patrol: A scalable and fault-tolerant framework
This paper addresses the Multi-Robot Patrolling Problem, where agents must coordinate their actions while continuously deciding which place to move next after clearing their locations. This problem is commonly addressed using centralized planners with global knowledge and/or calculating a priori routes for all robots before the beginning of the mission. In this work, two distributed techniques ...
متن کاملDetecting intruders in complex environments with limited range mobile sensors
This paper examines the problem of detecting intruders in large multiplyconnected environments with multiple robots and limited range sensors. We divide the problem into two sub-problems: 1) partitioning of the environment and 2) a new problem called weighted graph clearing. We reduce the second to a weighted tree clearing and present a solution for finding paths for the robot team that ensure ...
متن کاملIntelligent multi-agent modeling of the interbank network and evaluation of the impact of regulatory policies
agent-based modeling is an emerging computational technique that makes it possible to simulate complex economic systems, including the banking network, with a bottom-up approach. In this paper, the country's banking network is simulated with an intelligent multi-agent modeling model and indicates that these agents behave based on the adaptive learning. This modeling has been done with the aim o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017